By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 10, Issue 1, pp. 1-225

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Lower Bounds on the Complexity of Some Optimal Data Structures

Michael L. Fredman

pp. 1-10

BibTeX  Abstract Full Text:  PDF

Some NP-Complete Problems Similar to Graph Isomorphism

Anna Lubiw

pp. 11-21

BibTeX  Abstract Full Text:  PDF

Characterizations of Presburger Functions

Oscar H. Ibarra and Brian S. Leininger

pp. 22-39

BibTeX  Abstract Full Text:  PDF

On Etol Systems with Finite Tree-Rank

A. Ehrenfeucht, G. Rozenberg, and D. Vermeir

pp. 40-58

BibTeX  Abstract Full Text:  PDF

On the Selection of Test Data for Recursive Mathematical Subroutines

John H. Rowland and Philip J. Davis

pp. 59-72

BibTeX  Abstract Full Text:  PDF

Generalization of Voronoi Diagrams in the Plane

D. T. Lee and R. L. Drysdale, III

pp. 73-87

BibTeX  Abstract Full Text:  PDF

Fast Sorting of Weyl Sequences Using Comparisons

Martin H. Ellis and J. Michael Steele

pp. 88-95

BibTeX  Abstract Full Text:  PDF

Relative to a Random Oracle $A$, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability $1$

Charles H. Bennett and John Gill

pp. 96-113

BibTeX  Abstract Full Text:  PDF

A Note on the Complexity of General $D0L$ Membership

Neil D. Jones and Sven Skyum

pp. 114-117

BibTeX  Abstract Full Text:  PDF

On String Pattern Matching: A New Model with a Polynomial Time Algorithm

Ken-Chih Liu

pp. 118-140

BibTeX  Abstract Full Text:  PDF

Listing and Counting Subtrees of a Tree

Frank Ruskey

pp. 141-150

BibTeX  Abstract Full Text:  PDF

Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems

Manfred Kunde

pp. 151-173

BibTeX  Abstract Full Text:  PDF

Operator Precedence Grammars and the Noncounting Property

Stefano Crespi-Reghizzi, Giovanni Guida, and Dino Mandrioli

pp. 174-191

BibTeX  Abstract Full Text:  PDF

Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time

M. I. Dessouky and J. S. Deogun

pp. 192-202

BibTeX  Abstract Full Text:  PDF

Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs

Charles J. Colbourn and Kellogg S. Booth

pp. 203-225

BibTeX  Abstract Full Text:  PDF